Pattern Unification with Sequence Variables and Flexible Arity Symbols

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pattern Unification with Sequence Variables and Flexible Arity Symbols

A unification procedure for a theory with individual and sequence variables, free constants, free fixed and flexible arity function symbols and patterns is described. The procedure enumerates a set of substitution/constraint pairs which constitutes the minimal complete set of unifiers.

متن کامل

Pattern Unification with Sequence Variables, Flexible Arity Symbols

A unification procedure for a theory with individual and sequence variables, free constants, free fixed and flexible arity function symbols and patterns is described. The procedure enumerates a set of substitution/constraint pairs which constitutes the minimal complete set of unifiers.

متن کامل

Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms

A minimal and complete unification procedure for a theory with individual and sequence variables, free constants and free fixed and flexible arity function symbols is described and a brief overview of an extension with pattern-terms is given.

متن کامل

Theorem Proving with Sequence Variables and Flexible Arity Symbols

An ordering for terms with sequence variables and flexible arity symbols is presented. The ordering coincides with the lexicographic extension of multiset path ordering on terms without sequence variables. It is shown that the classical strict superposition calculus with ordering and equality constraints can be used as a refutationally complete proving method for well-constrained sets of clause...

متن کامل

Unification with Flexible Arity Symbols: a Typed Approach

In this paper we extend unification of terms with flexible arity function symbols with regular expression operators such as repetition (*), alternation, etc, that are used as types allowing a compact representation of terms with functors with an arbitrary number of arguments. This new unification can then be used to unify subterms in the middle of complexes sequences of terms leading to a quite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2002

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(04)80514-0